Almost envy-freeness in group resource allocation
نویسندگان
چکیده
منابع مشابه
Almost Envy-Freeness with General Valuations
e goal of fair division is to distribute resources among competing players in a “fair” way. Envy-freeness is the most extensively studied fairness notion in fair division. Envy-free allocations do not always exist with indivisible goods, motivating the study of relaxed versions of envy-freeness. We study the envy-freeness up to any good (EFX) property, which states that no player prefers the b...
متن کاملGeneralizing Envy-Freeness toward Group of Agents
Envy-freeness is a well-known fairness concept for analyzing mechanisms. Its traditional definition requires that no individual envies another individual. However, an individual (or a group of agents) may envy another group, even if she (or they) does not envy another individual. In mechanisms with monetary transfer, such as combinatorial auctions, considering such fairness requirements, which ...
متن کاملEnvy - Freeness and Implementation in Large Economies ∗
We show that an asymptotic envy-freeness is a necessary condition for a form of robust approximate implementation in large economies. We are grateful for financial support from the National Science Foundation under grant SES-9986190. We thank Andy Postlewaite for helpful comments on an earlier draft. Division of Humanities and Social Sciences 228-77, California Institute of Technology, Pasadena...
متن کاملEnvy - Freeness and Implementation in Large Economies ∗ Matthew
We show that an asymptotic envy-freeness condition is necessary for a form of robust approximate implementation in large economies. In settings where agents’ allocations can be made excludably, asymptotic envy-freeness is also sufficient for implementation, while in nonexcludable settings it is not sufficient. ∗We are grateful for financial support from the National Science Foundation under gra...
متن کاملOn the Interplay between Incentive Compatibility and Envy Freeness
We study mechanisms for an allocation of goods among agents, where agents have no incentive to lie about their true values (incentive compatible) and for which no agent will seek to exchange outcomes with another (envy-free). Mechanisms satisfying each requirement separately have been studied extensively, but there are few results on mechanisms achieving both. We are interested in those allocat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.07.008